Żywot Maniego (Kephalaia rozdz. I 9, 15 - 16, 31; LXXVI 183, 11 - 188, 29)
نویسندگان
چکیده
منابع مشابه
NpgRJ_Nmeth_1179 183..188
Massively parallel sequencing instruments enable rapid and inexpensive DNA sequence data production. Because these instruments are new, their data require characterization with respect to accuracy and utility. To address this, we sequenced a Caernohabditis elegans N2 Bristol strain isolate using the Solexa Sequence Analyzer, and compared the reads to the reference genome to characterize the dat...
متن کاملLiterature 31-03-15
We show that a new type of hydrogel can be prepared by covalently inter-linking binary blends of microgel (MG) particles and that the swelling ratio and modulus of the gels can be predicted from their composition. In previous work we established that physical gels of glycidyl methacrylate (GMA) functionalised poly(methyl methacrylate-co-methacrylic acidco-ethyleneglycol dimethacrylate) microgel...
متن کاملN = 31, D = 11
We show that eleven-dimensional supergravity backgrounds with thirty one supersymmetries, N = 31, admit an additional Killing spinor and so they are locally isometric to maximally supersymmetric ones. This rules out the existence of simply connected eleven-dimensional supergravity preons. We also show that N = 15 solutions of type I supergravities are locally isometric to Minkowski spacetime. T...
متن کاملBiol. Pharm. Bull. 29(1) 183—186 (2006)
tered in the database exceeds 20000000. Approximately 50000—70000 are usually utilized for the purpose of manufacturing pharmaceutical and personal care products (PPCP) and life related materials in Japan. In recent years, various pharmaceutical chemicals have been detected in river water, treated wastewater, and hospital wastewater in western countries, and together with endocrine disrupting c...
متن کاملCsci 3104, Cu-boulder Lectures 29 – 31
Suppose we have a set of items V along with a set of allowed pairings of items E : V × V , which defines a graph G = (V,E). A matching on this graph is a subset of edges E′ ⊆ E such that each vertex in V participates in at most one edge in E′. Call V ′ the set of vertices that participate in some edge e ∈ E′, and let M = (V ′, E′) denote a matching. Depending on additional requirements, we may ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Vox Patrum
سال: 2005
ISSN: 2719-3586,0860-9411
DOI: 10.31743/vp.8730